On the Design of Non-Fragile Compensators via Symbolic Quantifier Elimination
نویسندگان
چکیده
In this paper symbolic quantifier elimination methods are used to explore the fragility of feedback compensators, and to design feedback systems with non-fragile compensators. A compensator is said to be fragile if given variations in compensator parameters result in significant deterioration of feedback performance. The issue of fragility is important in understanding the level of acurracy required to implement a given compensator design.
منابع مشابه
Robust Nonlinear Feedback Design via Quantifier Elimination Theory
In this paper symbolic-computation methods are used to design simple, fixed-structure, robust controllers for nonlinear systems. Design specifications are reduced to logically quantified polynomial inequalities. The quantifier-elimination (QE) software package QEPCAD is used to eliminate quantifiers on state and plant parameters, to obtain regions of admissible controller parameters, and to gua...
متن کاملParametric Mechanism Design via Quantifier Elimination
This paper proposes an alternative automated mechanism design approach called parametric mechanism design via quantifier elimination (PMD-QE), which utilizes QE, a symbolic formula manipulation technique. In PMD-QE, we start from a skeleton of mechanisms, which is characterized by a set of parameters, e.g., critical values. The range of parameters where the given constraints are satisfied is au...
متن کاملNON-FRAGILE GUARANTEED COST CONTROL OF T-S FUZZY TIME-VARYING DELAY SYSTEMS WITH LOCAL BILINEAR MODELS
This paper focuses on the non-fragile guaranteed cost control problem for a class of T-S fuzzy time-varying delay systems with local bilinear models. The objective is to design a non-fragile guaranteed cost state feedback controller via the parallel distributed compensation (PDC) approach such that the closed-loop system is delay-dependent asymptotically stable and the closed-loop performance i...
متن کاملA Practical Implementation of a Symbolic-Numeric Cylindrical Algebraic Decomposition for Quantifier Elimination
Recently quantifier elimination (QE) has been of great interest in many fields of science and engineering. In this paper an effective symbolic-numeric cylindrical algebraic decomposition (SNCAD) algorithm and its variant specially designed for QE are proposed based on the authors’ previous work and our implementation of those is reported. Based on analysing experimental performances, we are imp...
متن کاملNearly-Exponential Size Lower Bounds for Symbolic Quantifier Elimination Algorithms and OBDD-Based Proofs of Unsatisfiability
We demonstrate a family of propositional formulas in conjunctive normal form so that a formula of size N requires size 2 7 √ N/logN) to refute using the tree-like OBDD refutation system of Atserias, Kolaitis and Vardi [3] with respect to all variable orderings. All known symbolic quantifier elimination algorithms for satisfiability generate tree-like proofs when run on unsatisfiable CNFs, so th...
متن کامل